翻訳と辞書 Words near each other ・ "O" Is for Outlaw ・ "O"-Jung.Ban.Hap. ・ "Ode-to-Napoleon" hexachord ・ "Oh Yeah!" Live ・ "Our Contemporary" regional art exhibition (Leningrad, 1975) ・ "P" Is for Peril ・ "Pimpernel" Smith ・ "Polish death camp" controversy ・ "Pro knigi" ("About books") ・ "Prosopa" Greek Television Awards ・ "Pussy Cats" Starring the Walkmen ・ "Q" Is for Quarry ・ "R" Is for Ricochet ・ "R" The King (2016 film) ・ "Rags" Ragland ・ ! (album) ・ ! (disambiguation) ・ !! ・ !!! ・ !!! (album) ・ !!Destroy-Oh-Boy!! ・ !Action Pact! ・ !Arriba! La Pachanga ・ !Hero ・ !Hero (album) ・ !Kung language ・ !Oka Tokat ・ !PAUS3 ・ !T.O.O.H.! ・ !Women Art Revolution Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク linear congruential generator ： ウィキペディア英語版 linear congruential generator A linear congruential generator (LCG) is an algorithm that yields a sequence of pseudo-randomized numbers calculated with a discontinuous piecewise linear equation. The method represents one of the oldest and best-known pseudorandom number generator algorithms.〔"(Linear Congruential Generators )" by Joe Bolte, Wolfram Demonstrations Project.〕 The theory behind them is relatively easy to understand, and they are easily implemented and fast, especially on computer hardware which can provide modulo arithmetic by storage-bit truncation. The generator is defined by the recurrence relation: : $X\_\; =\; \backslash left(\; a\; X\_n\; +\; c\; \backslash right)~~\backslash bmod~~m$ where $X$ is the sequence of pseudorandom values, and : : – the "multiplier" : – the "increment" : – the "seed" or "start value" are integer constants that specify the generator. If ''c'' = 0, the generator is often called a multiplicative congruential generator (MCG), or Lehmer RNG. If ''c'' ≠ 0, the method is called a ''mixed congruential generator''. == Period length == The period of a general LCG is at most ''m'', and for some choices of factor ''a'' much less than that. The LCG will have a full period for all seed values if and only if:〔 # $\backslash ,m$ and the offset $\backslash ,c$ are relatively prime, # $\backslash ,a\; -\; 1$ is divisible by all prime factors of $\backslash ,m$, # $\backslash ,a\; -\; 1$ is divisible by 4 if $\backslash ,m$ is divisible by 4. These three requirements are referred to as the Hull-Dobell Theorem. While LCGs are capable of producing pseudorandom numbers which can pass formal tests for randomness, this is extremely sensitive to the choice of the parameters ''c'', ''m'', and ''a''. Historically, poor choices had led to ineffective implementations of LCGs. A particularly illustrative example of this is RANDU, which was widely used in the early 1970s and led to many results which are currently being questioned because of the use of this poor LCG. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「linear congruential generator」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.